// Copyright [2020] <unknown>
#include <bits/stdc++.h>
using namespace std;
// #define ONLINE_JUDGE
#ifndef ONLINE_JUDGE
#define dbg(x...) { cerr << "\033[32;1m" << #x << " -> "; err(x); }
void err() { cerr << "\033[39;0m" << endl; }
template<typename T, typename... A>
void err(T a, A... x) { cerr << a << ' '; err(x...); }
#else
#define dbg(...)
#endif

#define sz(x) ((int)x.size())

typedef long long LL;

const int N = 2e3+50;
int d[N][N];

vector<int> G[N];

int n, x, y;

void bfs(int s, int d[]) {
    queue<int> q;
    const int INF = 0x3f3f3f3f;
    memset(d, INF, sizeof(int) * (n + 1));
    q.push(s);
    d[s] = 0;
    while (!q.empty()) {
        int u = q.front();
        // dbg(s, u, d[u]);
        q.pop();
        for (int v : G[u]) {
            if (d[v] > d[u] + 1) {
                d[v] = d[u] + 1;
                q.push(v);
            }
        }
    }
}
int cnt[N];

void add(int x, int y) {
    G[x].push_back(y);
    G[y].push_back(x);
}

int main(int argc, char const *argv[]) {
    // code
    scanf("%d%d%d", &n, &x, &y);
    add(x, y);
    for (int i=1; i<n; ++i)
        add(i, i+1);
    for (int i=1; i<=n; ++i)
        bfs(i, d[i]);
    for (int i=1; i<=n; ++i)
        for (int j=i+1; j<=n; ++j)
            cnt[d[i][j]]++;
    for (int i=1; i<n; ++i)
        printf("%d\n", cnt[i]);
    return 0;
}
